A Multi-paradigm Complexity Metric (MCM)

نویسندگان

  • Sanjay Misra
  • Ibrahim Akman
  • Ferid Cafer
چکیده

Authors References Cited By Index Terms Publication Reviews Comments Table of Contents Huge amount of researches and software metrics have been proposed for procedural and object-oriented languages. However, there are only few metrics available in the literature related with multi-paradigm programming languages. In this paper, we propose a metric to evaluate the code written in multi-paradigm language. Our proposed metric can be used for most of the programming paradigms, including both procedural and object-oriented languages. 1 Introduction Software qual ity has been raising demand for decades due to its complexity. Software development processes are treated as a complex task, therefore to control its complexity and to maintain the quality of software is a challenging job. A software product should carry several quality attributes, such as correctness, relialbility, efficiency, integrity, usability, maintainabi li ty, testability, flexibili ty, portabi liLy, reusability, and interoperability [ 1]. According to Somerville [2] the most necessary software quality anribute is maintainability and, to be able to maintain a software system efficiently, the codes should be understandable for the developers. This means, to achieve high quality code, reduction of code complexity is essential. Metrics are indicators of complexity and can be used to estimate software quality. There are a number of metrics each focusing on different complexity factors [3]. One may find the hundreds of metrics in the li terature for evaluating the software quality. These metrics [4-7 , 18-25] are of several types and for differe nt purposes. Somerville [2] categorizes metrics as control and predictor metrics. Control metrics are related to software processes, whereas predictor metrics are .associated with software products. Control metrics estimate effort, time and defects and predictor metrics assess the number of attributes and structures in a code. The literature provides several metrics for procedural and 00 paradigms. However, the re are very few metrics

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving Success Ratio in Multi-Constraint Quality of Service Routing

Multi-constraint quality-of-service routing will become increasingly important as the Internet evolves to support real-time services. It is well known however, that optimum multi-constraint QoS routing is computationally complex, and for this reason various heuristics have been proposed for routing in practical situations. Among these methods, those that use a single mixed metric are the mo...

متن کامل

Analysis and Design of Pilot-aided Multicarrier Systems over Doubly Selective Channels with a Local Subcarrier Processing Constraint

In the near future, the need for portable multi-antenna wireless devices supporting high data-rates in a harsh mobile environment is anticipated. Typically, in this scenario, the underlying wireless channels are timeand frequency selective, hence doubly selective (DS). Multicarrier modulation (MCM) schemes, wherein a stream of data is split into sub-streams and transmitted on a set of subcarrie...

متن کامل

Greedy Algorithms for the Multi-capacitated Metric Scheduling Problem

This paper investigates the performance of a set of greedy algorithms for solving the Multi-Capacitated Metric Scheduling Problem (MCM-SP). All algorithms considered are variants of ESTA (Earliest Start Time Algorithm), previously proposed in 3]. The paper starts with an analysis of ESTA's performance on diierent classes of MCM-SP problems. ESTA is shown to be eeective on several of these class...

متن کامل

Teaching-Learning approach in complexity paradigm

"Teaching-Learning Approach" is a model of interaction between teachers and students in an educational environment and one of the main components of the educational system. This model can be organized and designed on the basis of various opinions and ideas, including philosophical or scientific theories. This research aims to design and explain teaching-learning approach based on the complexity...

متن کامل

Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability

In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the MCM problem optimally. To the best of our knowledge, the proposed encodings and the optimization algorithm are the first formalization of the MCM problem in a PBS manner. This report evaluates the complexity of the prob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011